Commutative Locative Quantifiers for Multiplicative Linear Logic

نویسندگان

  • Stefano Guerrini
  • Patrizia Marzuoli
چکیده

The paper presents a solution to the technical problem posed by Girard after the introduction of Ludics of how to define proof nets with quantifiers that commute with multiplicatives. According to the principles of Ludics, the commuting quantifiers have a “locative” nature, in particular, quantified formulas are not defined modulo variable renaming. The solution is given by defining a new correctness criterion for first-order multiplicative proof structures that characterizes the system obtained by adding a congruence implying ∀x(A B) = ∀xA ∀xB to first-order multiplicative linear logic with locative quantifiers. In the conclusions we shall briefly discuss the interpretation of locative quantifiers as storage operators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulating Computations in Second Order Non-Commutative Linear Logic

Lincoln, Scedrov and Shankar proved undecidability of intuitionistic second order multiplicative commutative linear logic by embedding LJ2 into this logic. Emms did the same for intuitionistic second order non-commutative linear logic. Recently, Lafont and Scedrov demonstrated undecidability of classical second order multiplicative commutative linear logic. As for classical second order non-com...

متن کامل

Non-Commutative Logic I: The Multiplicative Fragment

We introduce proof nets and sequent calculus for the multiplicative fragment of non-commutative logic, which is an extension of both linear logic and cyclic linear logic. The two main technical novelties are a third switching position for the non-commutative disjunction, and the structure of order variety.

متن کامل

On Bunched Predicate Logic

We present the logic of bunched implications, BI, in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication, and may be viewed as a merging of intuitionistic logic and multiplicative, intuitionistic linear logic. The predi...

متن کامل

The logic of bunched implications

We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication; it can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. The naturality of BI can be seen cate...

متن کامل

Partially commutative linear logic: sequent calculus and phase semantics

In this short paper we introduce a variant of intuitionistic multiplicative linear logic that features both commutative and non-commutative connectives. This new logic extends conservatively both Girard’s multiplicative linear logic [2] and Lambek’s syntactic calculus [3]. Ultimately, our goal will be to fulfil the programme achieved by Girard in [2], i.e., to provide our system with: (1) a seq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006